package com.liufei.class06;


import com.liufei.common.TreeNode;

// https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/
public class Code04_MaximumDepthOfBinaryTree {

    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }

}
